// 笔试强训day25：笨小猴

#include <iostream>
#include <vector>
#include <math.h>
using namespace std;

bool isPrime(int n)
{
    if(n == 0 || n == 1)
        return false;
    for(int i = 2; i <= sqrt(n); i++)
    {
        if(n % i == 0)
            return false;
    }
    return true;
}

int main() {
    string str; cin >> str;
    vector<int> hash(26, 0);
    for(auto e : str)
    {
        hash[e - 'a']++;
    }

    int maxn = 0, minn = str.size();
    for(int i = 0; i < 26; i++)
    {
        if(hash[i] != 0)
        {
            maxn = max(hash[i], maxn);
            minn = min(hash[i], minn);
        }
    }

    if(isPrime(maxn - minn) && maxn >= minn)
    {
        cout << "Lucky Word" << endl;
        cout << maxn - minn << endl;
    }
    else 
    {
        cout << "No Answer" << endl;
        cout << 0 << endl;
    }
}